Hidden Markov modeling of speech using Toeplitz covariance matrices

نویسندگان

  • William J. J. Roberts
  • Yariv Ephraim
چکیده

Hidden Markov modeling of speech waveforms using structured covariance matrices is studied and applied to recognition of clean and noisy speech signals. This technique allows for easier model adaptation in additive noise than does cepstral modeling of speech. Waveform modeling using autoregressive (AR) structured covariances has been extensively studied and applied previously. However, other covariance structures are possible and here we consider waveform modeling using Toeplitz and circulant structured covariances. We detail maximum likelihood (ML) hidden Markov model training and recognition routines using these matrices, and ML speech gain estimation routines. We show equivalence of asymptotic probabilities of recognition error, under certain conditions, using Toeplitz and circulant matrices to using AR matrices. In experimental results on isolated digits in clean conditions, the Toeplitz covariance structure provides higher performance than the AR structure and has performance similar to that reported in the literature of a cepstral system on the same database. In additive Gaussian noise, we demonstrate superior performance to both the cepstral system and the AR system. Ó 2000 Elsevier Science B.V. All rights reserved.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Robust speech recognition using HMM's with toeplitz state covariance matrices

Hidden Markov modeling of speech waveforms is studied and applied to speech recognition of clean and noisy signals. Signal vectors in each state are assumed Gaussian with zero mean and a Toeplitz covariance matrix. This model allows short signal vectors and thus is useful for speech signals with rapidly changing second order statistics. It can also be straightforwardly adapted to noisy signals ...

متن کامل

Fast Likelihood Computation Method Using Block-diagonal Covariance Matrices in Hidden Markov Model

The paper presented a novel method to speed up the likelihood computation of the speech recognition system based continuous Hidden Markov Model (CHMM). The block-diagonal covariance matrices were applied in the method and the technique to construct an optimal block-diagonal matrix was introduced. The experimental results demonstrated that the block-diagonal covariance matrices could achieve a l...

متن کامل

Hierarchical Correlation Compensation For Hidden Markov Models

In this paper, we present a Hierarchical Correlation Compensation (HCC) scheme to reliably estimate full covariance matrices for Gaussian components in CDHMMs for speech recognition. First, we build a hierarchical tree in the covariance space, where each leaf node represents a Gaussian component in the CDHMM set. For all lower-level nodes in the tree, we estimate a diagonal covariance matrix as...

متن کامل

Semi-tied Full-covariance Matrices for Hidden Markov Models

There is normally a simple choice made in the form of the covariance matrix to be used with HMMs. Either a diagonal covariance matrix is used, with the underlying assumption that elements of the feature vector are independent, or a full or block-diagonal matrix is used, where all or some of the correlations are explicitly modelled. Unfortunately when using full or block-diagonal covariance matr...

متن کامل

Factored Semi-Tied Covariance Matrices

A new form of covariance modelling for Gaussian mixture models and hidden Markov models is presented. This is an extension to an efficient form of covariance modelling used in speech recognition, semi-tied covariance matrices. In the standard form of semi-tied covariance matrices the covariance matrix is decomposed into a highly shared decorrelating transform and a component-specific diagonal c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Speech Communication

دوره 31  شماره 

صفحات  -

تاریخ انتشار 2000